package org.hot100_6.leetcode53;

public class Solution2 {
    public int maxSubArray(int[] nums) {
        int [] dp = new int[nums.length];

        dp[0]=nums[0];

        int result =dp[0];

        for (int i = 1; i <nums.length; i++) {
            if (dp[i-1]>0){
                dp[i]=dp[i-1]+nums[i];
            }else {
                dp[i]=nums[i];
            }

            result = Math.max(result,dp[i]);
        }

        return result;
    }
}
